package com.person.leetcode.editor.cn;

/**
 * 1037.有效的回旋镖
 * 2022-06-08 10:38:34
 **/
public class Sequence_1037_ValidBoomerang {
    public static void main(String[] args) {
        Solution solution = new Sequence_1037_ValidBoomerang().new Solution();
    }

    //leetcode submit region begin(Prohibit modification and deletion)
    class Solution {
        public boolean isBoomerang(int[][] points) {
            int[] v1 = {points[1][0] - points[0][0], points[1][1] - points[0][1]};
            int[] v2 = {points[2][0] - points[0][0], points[2][1] - points[0][1]};
            return v1[0] * v2[1] - v1[1] * v2[0] != 0;
        }
    }

//leetcode submit region end(Prohibit modification and deletion)

}